Ultrafilters maximal for finite embeddability

In this paper we study a notion of preorder that arises in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and its generalization to ultrafilters, which is related to the algebraical and topological structure of the Stone-Čech compactification of the discrete space of natural numbers. In particular, we prove that there exist ultrafilters maximal for finite embeddability, and we show that the set of such ultrafilters is the closure of the minimal bilateral ideal in the semigroup (βN,⊕), namely K(βN,⊕). By combining this characterization with some known combinatorial properties of certain families of sets we easily derive some combinatorial properties of ultrafilters in K(βN,⊕). We also give an alternative proof of our main result based on nonstandard models of arithmetic. 2010 Mathematics Subject Classification 05A17, 11P81 (primary); 11B75, 11U10, 54D80 (secondary)